Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for L1 Shortest Paths Among Obstacles in the Plane (Draft)
We present an optimal Θ(n log n) algorithm for determining shortest paths according to the L1 (L∞) metric in the presence of disjoint polygonal obstacles in the plane. Our algorithm requires only linear O(n) space to build a planar subdivision (a Shortest Path Map) with respect to a fixed source point such that the length of a shortest path from the source to any query point can be reported in ...
متن کاملComputing L1 Shortest Paths among Polygonal Obstacles in the Plane
Given a point s and a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we present a new algorithm for building an L1 shortest path map of size O(n) in O(T ) time and O(n) space such that for any query point t, the length of the L1 shortest obstacleavoiding path from s to t can be reported in O(log n) time and the actual shortest path can be found in additional ...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملA Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
Given a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we study the problem of computing an L1 (or rectilinear) shortest path between two points avoiding the obstacles. Previously, this problem has been solved in O(n log n) time and O(n) space, or alternatively in O(n + h log n) time and O(n + h log h) space. A lower bound of Ω(n + h log h) time and Ω(n) spac...
متن کاملObstacle Distances and Visibility for Car-Like Robots Moving Forward
This paper deals with distance computation between a car-like robot moving only forward and polygonal obstacles. We propose eecient geometric algorithms to compute the shortest paths to obstacles. We then derive the \visibility" domain in the presence of obstacles , i.e. the set of positions reachable from a starting connguration, by a collision-free shortest path unaffected by the presence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990